A real options model of phased migration to cellular manufacturing

The literature is replete with models that examine various aspects of cellular manufacturing (CM), such as optimisation of cell layouts. However, many firms may realise zero to marginal returns from CM. Given this uncertainty, the manager should first determine the value of CM to the firm before deploying it. Although traditional valuation models employing discounted cash flow analysis allow for uncertainty, they treat future investments as fixed when computing the investment’s present value. The real options (RO) logic of valuation allows the manager to exercise the option to invest in or abandon a project based on expected outcomes. Future investments are thus options. This paper presents an RO model for CM migration that addresses whether a firm should migrate to CM; and it prescribes the sequence of cell deployment, which has not been addressed in the literature. Our model is also much more transparent and accessible to practitioners, with an accompanying software tool for prospective users. Finally, we use simulation extensively to discover the drivers of the optimal cell deployment sequence. Our results show that there is a complex interplay between net present value, speed of cellularisation, inter-cell learning and volatility in terms of their influence on the cell sequence.     

Characterization of weld seam properties of extruded magnesium hollow profiles

Extrusions of hollow profiles with weld seams were conducted using the magnesium alloy ME21 applying various extrusion ratios. Subsequent analysis of the profiles’ microstructure was performed comparing weld free with weld seam containing material using (polarized) light optical microscopy (LOM). Additionally, the local texture and microstructure in the weld-free material as well as in the weld seam region has been examined with a scanning electron microscope coupled with electron backscatter diffraction technique (SEM-EBSD). The weld-free material and the weld seam are characterized by recrystallized microstructures, whereas few residual cast grains were identified. The local texture distinctively changes from the weld-free material to the weld seam. The texture of the weld-free material is comparable with the typical ME21 sheet texture. In the weld seam area, a pole density is found, which is distributed towards the transverse direction (TD) combined with a split and broadening of the pole density in the extrusion direction (ED). This texture influences the mechanical anisotropy due to the dependence of the activation of basal 〈a〉-slip and \( \{ 10\bar{1}2\} \;\langle 10\bar{1}1\rangle \)-extension twinning on the loading direction in favorably oriented grains.     

Computational homogenization of elasticity on a staggered grid

In this article, we propose to discretize the problem of linear elastic homogenization by finite differences on a staggered grid and introduce fast and robust solvers. Our method shares some properties with the FFT‐based homogenization technique of Moulinec and Suquet, which has received widespread attention recently because of its robustness and computational speed. These similarities include the use of FFT and the resulting performing solvers. The staggered grid discretization, however, offers three crucial improvements. Firstly, solutions obtained by our method are completely devoid of the spurious oscillations characterizing solutions obtained by Moulinec–Suquet's discretization. Secondly, the iteration numbers of our solvers are bounded independently of the grid size and the contrast. In particular, our solvers converge for three‐dimensional porous structures, which cannot be handled by Moulinec–Suquet's method. Thirdly, the finite difference discretization allows for algorithmic variants with lower memory consumption. More precisely, it is possible to reduce the memory consumption of the Moulinec–Suquet algorithms by 50%. We underline the effectiveness and the applicability of our methods by several numerical experiments of industrial scale. Copyright © 2015 John Wiley & Sons, Ltd.     

Controlled counter-flow motion of magnetic bead chains rolling along microchannels

We demonstrate controlled transport of superparamagnetic beads in the opposite direction of a laminar flow. A permanent magnet assembles 200 nm magnetic particles into about 200 μm long bead chains that are aligned in parallel to the magnetic field lines. Due to a magnetic field gradient, the bead chains are attracted towards the wall of a microfluidic channel. A rotation of the permanent magnet results in a rotation of the bead chains in the opposite direction to the magnet. Due to friction on the surface, the bead chains roll along the channel wall, even in counter-flow direction, up to at a maximum counter-flow velocity of 8 mm s⁻¹. Based on this approach, magnetic beads can be accurately manoeuvred within microfluidic channels. This counter-flow motion can be efficiently be used in Lab-on-a-Chip systems, e.g. for implementing washing steps in DNA purification.     

On regular temporal logics with past

The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL and the closely related SystemVerilog Assertions, SVA for short, are increasingly used in many phases of the hardware design cycle, from specification to verification. In this article, we extend the common core of these specification languages with past operators. We name this extension PPSL. Although all ω-regular properties are expressible in PSL, SVA, and PPSL, past operators often allow one to specify properties more naturally and concisely. In fact, we show that PPSL is exponentially more succinct than the cores of PSL and SVA. On the star-free properties, PPSL is double exponentially more succinct than LTL. Furthermore, we present a translation of PPSL into language-equivalent nondeterministic Büchi automata, which is based on novel constructions for 2-way alternating automata. The upper bound on the size of the resulting nondeterministic Büchi automata obtained by our translation is almost the same as the upper bound for the nondeterministic Büchi automata obtained from existing translations for PSL and SVA. Consequently, the satisfiability problem and the model-checking problem for PPSL fall into the same complexity classes as the corresponding problems for PSL and SVA.     

Temporal kernel CCA and its application in multimodal neuronal data analysis

Data recorded from multiple sources sometimes exhibit non-instantaneous couplings. For simple data sets, cross-correlograms may reveal the coupling dynamics. But when dealing with high-dimensional multivariate data there is no such measure as the cross-correlogram. We propose a simple algorithm based on Kernel Canonical Correlation Analysis (kCCA) that computes a multivariate temporal filter which links one data modality to another one. The filters can be used to compute a multivariate extension of the cross-correlogram, the canonical correlogram, between data sources that have different dimensionalities and temporal resolutions. The canonical correlogram reflects the coupling dynamics between the two sources. The temporal filter reveals which features in the data give rise to these couplings and when they do so. We present results from simulations and neuroscientific experiments showing that tkCCA yields easily interpretable temporal filters and correlograms. In the experiments, we simultaneously performed electrode recordings and functional magnetic resonance imaging (fMRI) in primary visual cortex of the non-human primate. While electrode recordings reflect brain activity directly, fMRI provides only an indirect view of neural activity via the Blood Oxygen Level Dependent (BOLD) response. Thus it is crucial for our understanding and the interpretation of fMRI signals in general to relate them to direct measures of neural activity acquired with electrodes. The results computed by tkCCA confirm recent models of the hemodynamic response to neural activity and allow for a more detailed analysis of neurovascular coupling dynamics.     

A new linguistic MCDM method based on multiple-criterion data fusion

Multiple-criteria decision-making (MCDM) is concerned with the ranking of decision alternatives based on preference judgements made on decision alternatives over a number of criteria. First, taking advantage of data fusion technology to comprehensively consider each criterion data is a reasonable idea to solve the MCDM problem. Second, in order to efficiently handle uncertain information in the process of decision making, some well developed mathematical tools, such as fuzzy sets theory and Dempster Shafer theory of evidence, are used to deal with MCDM. Based on the two main reasons above, a new fuzzy evidential MCDM method under uncertain environments is proposed. The rating of the criteria and the importance weight of the criteria are given by experts’ judgments, represented by triangular fuzzy numbers. Then, the weights are transformed into discounting coefficients and the ratings are transformed into basic probability assignments. The final results can be obtained through the Dempster rule of combination in a simple and straight way. A numerical example to select plant location is used to illustrate the efficiency of the proposed method.     

FMS scheduling with knowledge based genetic algorithm approach

In this paper a complex scheduling problem in flexible manufacturing system (FMS) has been addressed with a novel approach called knowledge based genetic algorithm (KBGA). The literature review indicates that meta-heuristics may be used for combinatorial decision-making problem in FMS and simple genetic algorithm (SGA) is one of the meta-heuristics that has attracted many researchers. This novel approach combines KB (which uses the power of tacit and implicit expert knowledge) and inherent quality of SGA for searching the optima simultaneously. In this novel approach, the knowledge has been used on four different stages of SGA: initialization, selection, crossover, and mutation. Two objective functions known as throughput and mean flow time, have been taken to measure the performance of the FMS. The usefulness of the algorithm has been measured on the basis of number of generations used for achieving better results than SGA. To show the efficacy of the proposed algorithm, a numerical example of scheduling data set has been tested. The KBGA was also tested on 10 different moderate size of data set to show its robustness for large sized problems involving flexibility (that offers multiple options) in FMS.     

Estimating m-regimes STAR-GARCH model using QMLE with parameter transformation

It is well known in the literature that obtaining the parameter estimates for the Smooth Transition Autoregressive-Generalized Autoregressive Conditional Heteroskedasticity (STAR-GARCH) can be problematic due to computational difficulties. Conventional optimization algorithms do not seem to perform well in locating the global optimum of the associated likelihood function. This makes Quasi-Maximum Likelihood Estimator (QMLE) difficult to obtain for STAR-GARCH models in practice. Curiously, there has been very little research investigating the cause of the numerical difficulties in obtaining the parameter estimates for STAR-GARCH using QMLE. The aim of the paper is to investigate the nature of the numerical difficulties using Monte Carlo Simulation. By examining the surface of the log-likelihood function based on simulated data, the results provide several insights into the difficulties in obtaining QMLE for STAR-GARCH models. Based on the findings, the paper also proposes a simple transformation on the parameters to alleviate these difficulties. Monte Carlo simulation results show promising signs for the proposed transform. The asymptotic and robust variance-covariance matrices of the original parameter estimates are derived as a function of the transformed parameter estimates, which greatly facilitates inferences on the original parameters.     

Effective allocation of customers to distribution centres: A multiple ant colony optimization approach

The global and competitive business environment has identified the importance of a quick and efficient service towards the customers in the past few decades. Distribution centre (DC) plays an important role in maintaining the uninterrupted flow of goods and materials between the manufacturer and customers. The performance of the supply chain network can be easily improved by an effective or balanced allocation of customers to DCs. Improper or unbalanced allocation of customers can lead to the under- or overutilization of facilities and can further deteriorate the customer service. Performance of the DC can be judged on the basis of its ability to provide the right goods, at the right time and at the right place. The lead time or transit time to deliver the goods to the customers is an important parameter for the measuring the efficiency and effectiveness of a particular DC in a supply chain. In this paper, a multiple ant colony optimization (MACO) approach is discussed in an effort to design a balanced and efficient supply chain network that maintains the best balance of transit time and customers service. The focus of this paper is on the effective allocation of the customers to the DCs with the two-fold objective of minimization of the transit time and degree of imbalance of the DCs. MACO technique is a modified form of the traditional ant colony system, where multiple ant colonies cooperate with each other to find the best possible customer allocation pattern for the DC. The proposed technique shows better performance because of its nature of considering both positive and negative feedback in search of optimum or near-optimum results. The developed algorithm based on the proposed approach is tested on a real practical problem and the results are discussed in this paper.